GPU parallel implementation of the new hybrid binarization based on Kmeans method (HBK)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Implementation of Otsu’s Binarization Approach on GPU

Fast algorithms are important for efficient image processing systems for handling large set of calculations. To speedup the processing, parallel implementation of an algorithm can be done using Graphics Processing Unit (GPU). GPU is general purpose computation hardware; programmability and low cost make it productive. Binarization is widely used technique in the image analysis and recognition a...

متن کامل

Parallel Implementation of Souvola’s Binarization Approach on GPU

Binarization is widely used technique in many of the image processing applications. Fast algorithms are needed for fast and efficient image processing systems. Many algorithms of image processing and pattern recognition have recently been implemented on Graphic Processing Unit (GPU) for faster computational times. GPUs are most prominent hardware in utilizing parallelism and pipelining than gen...

متن کامل

A GPU Based Memory Optimized Parallel Method For FFT Implementation

FFT (fast Fourier transform) plays a very important role in many fields, such as digital signal processing, digital image processing and so on. However, in application, FFT becomes a factor of affecting the processing efficiency, especially in remote sensing, which large amounts of data need to be processed with FFT. So shortening the FFT computation time is particularly important. GPU (Graphic...

متن کامل

Implementation of a parallel tree method on a GPU

The kd-tree is a fundamental tool in computer science. Among other applications, the application of kd-tree search (by the tree method) to the fast evaluation of particle interactions and neighbor search is highly important, since the computational complexity of these problems is reduced from O(N2) for a brute force method to O(N log N) for the tree method, where N is the number of particles. I...

متن کامل

GPU-based Parallel Hybrid Genetic Algorithms

Over the last years, interest in hybrid metaheuristics has risen considerably in the field of optimization. Combinations of algorithms such as genetic algorithms (GAs) and local search (LS) methods have provided very powerful search algorithms. However, due to their complexity, the computational time of the solution search exploration remains exorbitant when large problem instances are to be so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Real-Time Image Processing

سال: 2014

ISSN: 1861-8200,1861-8219

DOI: 10.1007/s11554-014-0458-2